Decomposition Approaches for Power Reduction
نویسندگان
چکیده
The article discusses a synthesis strategy aimed at reducing power consumption consumed by logic structures implemented in FPGAs. essence of the method is to carry out multioutput function decomposition, which takes into account problem dynamic reduction. presents several techniques leading such reduction: preliminary ordering variables taking probabilities occurrence value 1 for individual variables, reduction number LUTs limiting bound functions, and particular bicoding or appropriate unicoding need reduce implementation functions. These have been combined coherent called PowerdekBDD, an extension DekBDD strategy, result many years work area using BDD graphs. contains results experiments confirming effectiveness presented strategy.
منابع مشابه
The Decomposition of DSP’s Control Logic Block for Power Reduction
The paper considers the architecture and low power design aspects of the digital signal processing block embedded into a three-phase integrated power meter IC. Utilized power reduction techniques were focused on the optimization of control logic block. The operations that control unit performs are described together with power optimization results.
متن کاملGraph Decomposition Approaches for Terminology Graphs
We propose a graph-based decomposition methodology of a network of document features represented by a terminology graph. The graph is automatically extracted from raw data based on Natural Language Processing techniques implemented in the TermWatch system. These graphs are Small Worlds. Based on clique minimal separators and the associated graph of atoms: a subgraph without clique separator, we...
متن کاملDecomposition approaches for recoverable robust optimization problems
Real-life planning problems are often complicated by the occurrence of disturbances, which imply that the original plan cannot be followed anymore and some recovery action must be taken to cope with the disturbance. In such a situation it is worthwhile to arm yourself against possible disturbances by including recourse actions in your planning strategy. Well-known approaches to create plans tha...
متن کاملDecomposition Approaches for a Capacitated Hub Problem
In this work we address a capacitated hub problem arising from a Telecommunications application. In this problem we must choose the routes and the hubs to use in order to send a set of commodities from sources to destinations in a given capacitated network with a minimum cost. The capacities and costs of the arcs and hubs are given, and the graph connecting the hubs is not assumed to be complet...
متن کاملLow Power Multiplication Algorithm for Switching Activity Reduction through Operand Decomposition
A novel low power multiplication algorithm for reducing switching activity through operand decomposition is proposed. Our experimental results show 12% to 18% reduction in logic transitions in both array multipliers and tree multipliers of 32 bits and 64 bits. Similar results are obtained for dynamic power dissipation after logic synthesis. One additional logic gate is required on the critical ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2023
ISSN: ['2169-3536']
DOI: https://doi.org/10.1109/access.2023.3260970